THE INVISCID LIMIT OF THE MODIFIED BENJAMIN–ONO–BURGERS EQUATION
نویسندگان
چکیده
منابع مشابه
The Inviscid Limit of the Complex Ginzburg–Landau Equation
Naturally the question of inviscid limit arises. Does the solution u of the CGL equation (1.1) tend to (in an appropriate space norm) the solution v of the NLS equation (1.2) as the parameters a and b tend to 0? What is the convergence rate? The answers are not immediate especially when the initial data for these equations are not smooth. Because of its importance in both mathematical theory an...
متن کاملGlobal well-posedness and inviscid limit for the modified Korteweg-de Vries-Burgers equation
Considering the Cauchy problem for the modified Korteweg-de Vries-Burgers equation ut + uxxx + ǫ|∂x| u = 2(u)x, u(0) = φ, where 0 < ǫ, α ≤ 1 and u is a real-valued function, we show that it is uniformly globally well-posed in Hs (s ≥ 1) for all ǫ ∈ (0, 1]. Moreover, we prove that for any s ≥ 1 and T > 0, its solution converges in C([0, T ]; Hs) to that of the MKdV equation if ǫ tends to 0.
متن کاملa study on construction of iranian life tables: the case study of modified brass logit system
چکیده ندارد.
15 صفحه اولthe effect of task cognitive complexity and time limit on the performance of the learners with different proficiency levels in second language writing skill
this study investigated the effects of manipulating the cognitive complexity of tasks along +/- few elements and the time limits on l2 learners writing performance. to conduct the study, 60 iranian efl learners with two levels of proficiency, low and high intermediate, were selected and assigned to three groups based on the time devoted to task completion. the participants performed both a simp...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 2010
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972710001905